Worlds to Discover

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning to Automatically Discover Meronyms

We present a system for automatically discovering meronyms (noun pairs in a part-whole relationship) from text corpora. More precisely, our system begins by parsing and extracting dependency paths similar to (but not the same as) those used by (Snow et al., 2004). For each noun pair we calculate an empirical distribution over dependency relations, which are then used as features of a Support Ve...

متن کامل

From Worlds to Machines

This paper provides a personal account of some of the foundational contributions made by Michael Jackson in the area of Requirements Engineering. We specifically focus on the relationship between problem worlds and machine solutions, and try to connect each contribution to related efforts while suggesting possible continuations. The anchoring of machine solutions on problem worlds is first cons...

متن کامل

A Network Algorithm to Discover Sequential Patterns

This paper addresses the discovery of sequential patterns in very large databases. Most of the existing algorithms use lattice structures in the space search that are very demanding computationally. The output of these algorithms generates a large number of rules. The aim of this work is to create a swift algorithm for the discovery of sequential patterns with a low time complexity. In this wor...

متن کامل

Building to Discover: A Common Coding Model

I present a case study of scientific discovery, where building two functional and behavioral approximations of neurons, one physical and the other computational, led to conceptual and implementation breakthroughs in a neural engineering laboratory. Such building of external systems that mimic target phenomena, and the use of these external systems to generate novel concepts and control structur...

متن کامل

Learning to Discover Sparse Graphical Models

We consider structure discovery of undirected graphical models from observational data. Inferring likely structures from few examples is a complex task often requiring the formulation of priors and sophisticated inference procedures. In the setting of Gaussian Graphical Models (GGMs) a popular estimator is a maximum likelihood objective with a penalization on the precision matrix. Adapting this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Astronomy & Geophysics

سال: 1998

ISSN: 1366-8781,1468-4004

DOI: 10.1093/astrog/39.5.5.4-a